Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations
نویسندگان
چکیده
منابع مشابه
Design of Linear and Planar Fractal Arrays
This paper describes the theories and techniques for designing linear and planar fractal arrays and compare their radiation pattern with conventional arrays. Fractals are recursively generated object having fractional dimension. We have compared radiation pattern of cantor linear arrays with conventional linear arrays using MATLAB program. Another program was developed to characterize the radia...
متن کاملFast Synthesis of Planar, Maximally Thinned Arrays
In this paper a method for a fast synthesis of planar, maximally thinned and steerable arrays is proposed and tested on several benchmarks available in literature. The method optimizes simultaneously the weight coefficients and sensor positions of a planar array without using global optimization schemes, properly exploiting convex optimization based algorithms. The resulting arrays are able to ...
متن کاملModification of Sidelobe Canceller System In Planar Arrays (RESEARCH NOTE)
A Side Lobe Canceller (SLC) structure is a conventional partially adaptive technique which is used in large adaptive array radars. If a desired signal has long time duration in comparison with the SLC adaptation time, signal components may be cancelled. So, this paper presents a modified SLC which eliminates desired signal cancellation problems and allows using an unconstrained adaptive algorit...
متن کاملSynthesis of Thinned Linear and Planar Antenna Arrays Using Binary Pso Algorithm
Traditional optimization methods are not well suitable for thinning large arrays to obtain a low sidelobe level (SLL). The chaotic binary particle swarm optimization (CBPSO) algorithm is presented as a useful alternative for the synthesis of thinned arrays. The proposed algorithm can be improved by nonlinear inertia weight with chaotic mutation to increase the diversity of particles. Two exampl...
متن کاملLinear Sequential Arrays: Pipelining Arithmetic Data Paths
Arithmetic algorithms typically use broadcasting for the distribution of control data to all bit slices in the data path. Since routing delays grow as a function of fanout and routing distance, broadcasting delays grow as a function of precision in arithmetic implementations. Broadcasting in the critical path degrades performance and causes implementations of diiering precisions to experience d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2019.2962998